Dynamic Replication of Fault-Tolerant Scheduling Algorithm

نویسندگان

  • Wang Hongxia
  • Qiu Xin
چکیده

In order to reduce the impact on the grid scheduling caused by the resource error, for complex dependent tasks, designed a dynamic replication of fault-tolerant scheduling algorithm (DRFT). This algorithm build task model by applying hypergraph theory, using primary-backup task as backup mode, take the active execution mode combined with the passive execution mode to perform the backup task, set up dynamic backup level according to the level of importance and resources security condition of dependent task, pursuit time of the task execution is minimized, the simulation result shows that the algorithm can still be accomplished scheduling quickly in case of error caused by the resource, to make up the shortage of common algorithms in terms of fault-tolerant.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fault-Tolerant Scheduling for Bag-of-Tasks Grid Applications

In this paper we propose a fault-tolerant scheduler for Bagof-Tasks Grid applications, calledWorkQueue with Replication Fault Tolerant (WQR-FT), obtained by adding checkpointing and replication to the WorkQueue with Replication (WQR) scheduling algorithm. By using discrete-event simulation, we show that WQR-FT not only ensures the successful completion of all the tasks in a bag, but also achiev...

متن کامل

Task Scheduling and Seedblock Based Fault Tolerance in Cloud

Cloud computing is one of the essential paradigms of concern to the data sharing resources and utilization of data computation in data centers. Resource services in cloud computing is widely used these days. Cloud computing has a main drawback of fault tolerance. Maintaining of the fault tolerance is a necessity in providing availability and reliability of critical services in cloud services. T...

متن کامل

Performance Evaluation of Integrated Fault-Tolerant Technique: Simulation Study

In earlier work we have proposed the concept of the dynamic group maximum matching for grouping the system graph into groups of different sizes according to the tasks arriving at the system. Also, we have developed a more efficient integrated fault-tolerant technique for ultra-reliable execution of tasks where both hardware (processors and communication channels) and software failures, and on-l...

متن کامل

Evaluation of Hft Technique Performance Using Task-scheduling Algorithms

In earlier work we have introduced an efficient hardware fault-tolerant approach for reliable execution of tasks. The proposed approach called the Hardware Fault-Tolerant (HFT) approach. Also, we have introduced the concept of dynamic group maximum matching, which is used to group nodes of a graph into disjoint groups with different sizes dynamically. Furthermore, we have proposed the Dynamic G...

متن کامل

Fault Tolerant Based Hyper-heuristic Algorithm for Task Scheduling in Cloud

Cloud computing is one of the recent emerging technologies for providing classy services by means of the Internet based on the requirements of the users. Numerous efficient scheduling algorithms are required to make a valuable use of terrific capabilities of the cloud environment. The aim of task scheduling is to schedule the tasks within the given deadline to achieve minimum makespan. The heur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015